Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in <i>seru</i> production systems

نویسندگان

چکیده

Worker assignment is critical for developing a flexible and human-centered seru production system (SPS). Most studies in the literature focus on worker with objective of maximizing efficiency, which causes an inescapable consequence that workers high proficiency levels experience overwork compared lower levels. From perspective workload equity, we investigate problem SPS, where heterogeneity diverse skill sets taken into account. A mixed integer nonlinear programming model named equity-oriented proposed this to mitigate inequity among by minimizing maximum workers. The linearized solved CPLEX solver small-scale instances. For efficiently solving large-scale instances, design hybrid genetic algorithm combined local search. Computational experiments demonstrate performance algorithm, both terms computing time solution quality. We find using can significantly balance at cost minimal increases total labor hours.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

A Multi Hybrid Genetic Algorithm for the Quadratic Assignment Problem

Quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems which can model many real life problems. Because of its theoretical and practical importance, QAP has attracted attention of many researchers. In this paper, a multi hybrid genetic algorithm for solving QAP is proposed. The key feature of our approach is the hybridization of three metaheuristics, tabu s...

متن کامل

A hybrid genetic algorithm for the Three-Index Assignment Problem

The Three-Index Assignment Problem (AP3) is well-known problem which has been shown to be NP-hard. This problem has been studied extensively, and many exact and heuristic methods have been proposed to solve it. Inspired by the classical assignment problem, we propose a new local search heuristic which solves the problem by simplifying it to the classical assignment problem. We further hybridize...

متن کامل

A Hybrid Genetic Algorithm for the Quadratic Assignment Problem

A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the results obtained through the application of each of these algorithms separately. The QAP is a NP-hard problem and instances of size n > 15 are still considered intractable. The results of our experiments suggest that CHC com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial and Management Optimization

سال: 2023

ISSN: ['1547-5816', '1553-166X']

DOI: https://doi.org/10.3934/jimo.2023068